1609.Even Odd Tree.go

package leetcode

typeTreeNodestruct {
Valint
Left*TreeNode
Right*TreeNode
}

funcisEvenOddTree(root*TreeNode) bool {
level:=0
queue:= []*TreeNode{root}
forlen(queue) !=0 {
length:=len(queue)
varnums []int
fori:=0; i<length; i++ {
node:=queue[i]
ifnode.Left!=nil {
queue=append(queue, node.Left)
 }
ifnode.Right!=nil {
queue=append(queue, node.Right)
 }
nums=append(nums, node.Val)
 }
iflevel%2==0 {
if!even(nums) {
returnfalse
 }
 } else {
if!odd(nums) {
returnfalse
 }
 }
queue=queue[length:]
level++
 }
returntrue
}

funcodd(nums []int) bool {
cur:=nums[0]
ifcur%2!=0 {
returnfalse
 }
for_, num:=rangenums[1:] {
ifnum>=cur {
returnfalse
 }
ifnum%2!=0 {
returnfalse
 }
cur=num
 }
returntrue
}

funceven(nums []int) bool {
cur:=nums[0]
ifcur%2==0 {
returnfalse
 }
for_, num:=rangenums[1:] {
ifnum<=cur {
returnfalse
 }
ifnum%2==0 {
returnfalse
 }
cur=num
 }
returntrue
}